Facets for continuous multi-mixing set with general coefficients and bounded integer variables

نویسندگان

  • Manish Bansal
  • Kiavash Kianfar
چکیده

Bansal and Kianfar introduced continuous multi-mixing set where the coefficients satisfy the so-called n-step MIR conditions and developed facet-defining inequalities for this set. In this paper, we first generalize their inequalities for the continuous multi-mixing set with general coefficients (where no conditions are imposed on the coefficients) and show that they are facetdefining in many cases. Next, we further generalize the continuous multi-mixing set with general coefficients by incorporating upper bounds on the integer variables. We introduce a family of valid inequalities for this set through a unified generalization of the n-step cycle inequalities and the mingled n-step MIR inequalities. We indicate how to separate over these inequalities in polynomial time and present the conditions under which a subset of these inequalities are facet-defining.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The continuous knapsack set

We study the convex hull of the continuous knapsack set which consists of a single inequality constraint with n non-negative integer andm non-negative bounded continuous variables. When n = 1, this set is a slight generalization of the single arc flow set studied by Magnanti, Mirchandani, and Vachani (1993). We first show that in any facet-defining inequality, the number of distinct non-zero co...

متن کامل

Mixed n-step MIR inequalities: Facets for the n-mixing set

Günlük and Pochet [O. Günlük , Y. Pochet: Mixing mixed integer inequalities. Mathematical Programming 90(2001) 429-457] proposed a procedure to mix mixed integer rounding (MIR) inequalities. The mixed MIR inequalities define the convex hull of the mixing set {(y, . . . , y, v) ∈ Z × R+ : α1y + v ≥ βi, i = 1, . . . ,m} and can also be used to generate valid inequalities for general as well as se...

متن کامل

Intersection Cuts for Single Row Corner Relaxations

We consider the problem of generating inequalities that are valid for one-row relaxations of a simplex tableau, with the integrality constraints preserved for one or more non-basic variables. These relaxations are interesting because they can be used to generate cutting planes for general mixed-integer problems. We first consider the case of a single nonbasic integer variable. This relaxation i...

متن کامل

Continuous knapsack sets with divisible capacities Laurence

We study two continuous knapsack sets Y! and Y" with n integer, one unbounded continuous and m bounded continuous variables in either ! or " form. When the coefficients of the integer variables are integer and divisible, we show in both cases that the convex hull is the intersection of the bound constraints and 2m polyhedra arising from a continuous knapsack set with a single unbounded continuo...

متن کامل

A new method to determine a well-dispersed subsets of non-dominated vectors for MOMILP ‎problem

Multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. The optimality of such optimizations is largely defined through the Pareto optimality. Multiple objective integer linear programs (MOILP) are special cases of multiple criteria decision making problems. Numerous algorithms have been desig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Optimization

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2017